Research on Multi-Objective Minimum Spanning Tree Algorithm Based on Ant Algorithm
نویسندگان
چکیده
The ant algorithm is a branch of the artificial intelligence, which is developed from natural rules and of strong adaptability and expandability. Compared to other conventional algorithms, the algorithm has an unparalleled advantage that is demonstrated on combinatorial optimization problems through its application in the multi-objective minimum spanning tree.
منابع مشابه
A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملOPTIMIZATION OF TREE-STRUCTURED GAS DISTRIBUTION NETWORK USING ANT COLONY OPTIMIZATION: A CASE STUDY
An Ant Colony Optimization (ACO) algorithm is proposed for optimal tree-structured natural gas distribution network. Design of pipelines, facilities, and equipment systems are necessary tasks to configure an optimal natural gas network. A mixed integer programming model is formulated to minimize the total cost in the network. The aim is to optimize pipe diameter sizes so that the location-alloc...
متن کاملMultiple criteria minimum spanning trees
The NP multiple criteria minimum spanning tree as several applications into the network design problems. In this paper, we first introduce some properties than can help to characterize the problem, as well as to produce heuristics to solve it in a more efficient way. In the second part, we propose an application of the Multiple Objective Network optimization based on the Ant Colony Optimization...
متن کاملCombinatorial optimization and the analysis of randomized search heuristics
Randomized search heuristics have widely been applied to complex engineering problems as well as to problems from combinatorial optimization. We investigate the runtime behavior of randomized search heuristics and present runtime bounds for these heuristics on some well-known combinatorial optimization problems. Such analyses can help to understand better the working principle of these algorith...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کامل